Vector optimization problems with linear criteria over a fuzzy combinatorial set of alternatives

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Expressing Combinatorial Optimization Problems by Linear Programs

Many combinatorial optimization problems call for the optimization of a linear function over a certain polytope. Typically, these polytopes have an exponential number of facets. W e explore the problem of finding small l inear programming formulations when one may use any new variables and constraints. W e show that expressing the matching and the Traveling Salesman Problem by a symmetric linea...

متن کامل

SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS WITH LINEAR MEMBERSHIP FUNCTIONS-REVISITED

Recently, Gasimov and Yenilmez proposed an approach for solving two kinds of fuzzy linear programming (FLP) problems. Through the approach, each FLP problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. Then, the crisp problem is solved by the use of the modified subgradient method. In this paper we will have another look at the earlier defuzzifi...

متن کامل

Bargaining over a finite set of alternatives

We analyze bilateral bargaining over a finite set of alternatives. We look for “good” ordinal solutions to such problems and show that Unanimity Compromise and Rational Compromise are the only bargaining rules that satisfy a basic set of properties. We then extend our analysis to admit problems with countably infinite alternatives. We show that, on this class, no bargaining rule choosing finite...

متن کامل

Combinatorial Optimization Problems with Testing

In stochastic versions of combinatorial optimization problems, the goal is to optimize an objective function under constraints that specify the feasible solutions, when some parameters involve uncertainty. We focus on maximizing a linear objective ∑N i=1Wixi, where x1, . . . , xN are the decision variables, W1, . . . ,WN are mutually independent random coefficients, and the constraints are dete...

متن کامل

An interactive fuzzy satisficing method for random fuzzy multiobjective linear programming problems through fractile criteria optimization with possibility

This paper considers multiobjective linear programming problems where each coefficient of the objective functions is expressed by a random fuzzy variable. A new decision making model is proposed by incorporating the concept of fractile criteria optimization into a possibilistic programming model. An interactive fuzzy satisficing method is presented for deriving a satisficing solution for a deci...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Cybernetics and Systems Analysis

سال: 2011

ISSN: 1060-0396,1573-8337

DOI: 10.1007/s10559-011-9307-5